Theoretical Bounds on Performance in Threshold Group Testing Schemes
نویسندگان
چکیده
منابع مشابه
Threshold Group Testing
We introduce a natural generalization of the well-studied group testing problem: A test gives a positive (negative) answer if the pool contains at least u (at most l) positive elements, and an arbitrary answer if the number of positive elements is between these fixed thresholds l and u. We show that the p positive elements can be determined up to a constant number of misclassifications, bounded...
متن کاملThreshold Group Testing on Inhibitor Model
In classical group testing, one is given a population [Formula: see text] and an unknown subset [Formula: see text] of positive items, and the goal is to determine D by testing subsets of [Formula: see text]. Threshold group testing is a generalization of classical group testing, where the outcome of a group test is determined by the number of positive items in the test. In group testing on inh...
متن کاملThreshold and Majority Group Testing
We consider two generalizations of group testing: threshold group testing (introduced by Damaschke [7]) and majority group testing (a further generalization, including threshold group testing and a model introduced by Lebedev [14]). We show that each separating code gives a nonadaptive strategy for threshold group testing for some parameters. This is a generalization of a result in [2] on “gues...
متن کاملA Group of Threshold Group-Signature Schemes with Privilege Subsets
(State Key Laboratory of Information Security (Graduate School, The Chinese Academy of Sciences), Beijing 100049, China) (Institute of Electronics, The Chinese Academy of Sciences, Beijing 100080, China) (State Key Laboratory of Information Security (Institute of Software, The Chinese Academy of Sciences), Beijing 100080, China) + Corresponding author: Phn: +86-10-66842704, Fax: +86-10-62645000...
متن کاملOn Dynamic Threshold Schemes
An (m, n) threshold scheme is to decompose the master key K into n secret shadows in such a way that the master key K cannot be reclaimed unless any m shadows are collected. However, any m 1 or fewer shadows provide absolutely no information about K. In 1989, Laih et al. proposed the concept of dynamic threshold schemes which allow the master key to be updated without changing the secret shadow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8040637